Word-representability of split graphs
نویسندگان
چکیده
منابع مشابه
Word-Representability of Line Graphs
A graph is representable if there exists a word over the alphabet such that letters = , G V E W V x and alternate in W if and only if y , x y is in E for each x not equal to . The motivation to study representable graphs came from algebra, but this subject is interesting from graph theoretical, computer science, and combinatorics on words points of view. In this paper, we prove that for...
متن کاملWord-representability of triangulations of grid-covered cylinder graphs
A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y, x 6= y, alternate in w if and only if (x, y) ∈ E. Halldórsson, Kitaev and Pyatkin have shown that a graph is word-representable if and only if it admits a so-called semi-transitive orientation. A corollary of this result is that any 3-colorable graph is wordrepresentable.Masárová Akro...
متن کاملWord-Representability of Face Subdivisions of Triangular Grid Graphs
A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w if and only if (x, y) ∈ E. A triangular grid graph is a subgraph of a tiling of the plane with equilateral triangles defined by a finite number of triangles, called cells. A face subdivision of a triangular grid graph is replacing some of its cells by plane copies of the...
متن کاملOn the Representability of Line Graphs
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) is in E for each x not equal to y. The motivation to study representable graphs came from algebra, but this subject is interesting from graph theoretical, computer science, and combinatorics on words points of view. In this paper, we prove that for n gre...
متن کاملCutwidth of Split Graphs and Threshold Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Threshold graphs are a well-studied subclass of interval graphs and of split graphs, both of which are unrelated subclasses of chordal graphs. To complement our result, we show that cutwidth is NPcomplete on split graphs, and consequently a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Combinatorics
سال: 2021
ISSN: ['2150-959X', '2156-3527']
DOI: https://doi.org/10.4310/joc.2021.v12.n4.a6